A Polytope Related to Empirical Distributions, Plane Trees, Parking Functions, and the Associahedron

نویسندگان

  • Richard P. Stanley
  • Jim Pitman
چکیده

The volume of the n-dimensional polytope n(x) := fy 2 R n : yi 0 and y1 + + yi x1 + + xi for all 1 i ng for arbitrary x := (x1; : : : ; xn) with xi > 0 for all i de nes a polynomial in variables xi which admits a number of interpretations, in terms of empirical distributions, plane partitions, and parking functions. We interpret the terms of this polynomial as the volumes of chambers in two di erent polytopal subdivisions of n(x). The rst of these subdivisions generalizes to a class of polytopes called sections of order cones. In the second subdivision, the chambers are indexed in a natural way by rooted binary trees with n + 1 vertices, and the con guration of these chambers provides a representation of another polytope with many applications, the associahedron. Research supported in part by NSF grant 97-03961 Research supported in part by NSF grant 95-00714

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A ug 1 99 9 A polytope related to empirical distributions , plane trees , parking functions , and the associahedron

The volume of the n-dimensional polytope Π n (x) := {y ∈ R n : y i ≥ 0 and y 1 + · · · + y i ≤ x 1 + · · · + x i for all 1 ≤ i ≤ n} for arbitrary x := (x 1 ,. .. , x n) with x i > 0 for all i defines a polynomial in variables x i which admits a number of interpretations, in terms of empirical distributions, plane partitions, and parking functions. We interpret the terms of this polynomial as th...

متن کامل

Parking functions and triangulation of the associahedron

We show that a minimal triangulation of the associahedron (Stasheff polytope) of dimension n is made of (n+ 1)n−1 simplices. We construct a natural bijection with the set of parking functions from a new interpretation of parking functions in terms of shuffles. Introduction The Stasheff polytope, also known as the associahedron, is a polytope which comes naturally with a poset structure on the s...

متن کامل

Expansive Motions and the Polytope of Pointed Pseudo-Triangulations

We introduce the polytope of pointed pseudo-triangulations of a point set in the plane, defined as the polytope of infinitesimal expansive motions of the points subject to certain constraints on the increase of their distances. Its 1-skeleton is the graph whose vertices are the pointed pseudo-triangulations of the point set and whose edges are flips of interior pseudo-triangulation edges. For p...

متن کامل

Generalized Parking Functions, Descent Numbers, and Chain Polytopes of Ribbon Posets

We consider the inversion enumerator In(q), which counts labeled trees or, equivalently, parking functions. This polynomial has a natural extension to generalized parking functions. Substituting q = −1 into this generalized polynomial produces the number of permutations with a certain descent set. In the classical case, this result implies the formula In(−1) = En, the number of alternating perm...

متن کامل

Dichotomy of the addition of natural numbers

This is an elementary presentation of the arithmetic of trees. We show how it is related to the Tamari poset. In the last part we investigate various ways of realizing this poset as a polytope (associahedron), including one inferred from Tamari’s thesis.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete & Computational Geometry

دوره 27  شماره 

صفحات  -

تاریخ انتشار 2002